On linear combinations of units with bounded coefficients and double-base digit expansions

نویسندگان

  • Daniel Krenn
  • Jörg Thuswaldner
  • Volker Ziegler
چکیده

Let [Formula: see text] be the maximal order of a number field. Belcher showed in the 1970s that every algebraic integer in [Formula: see text] is the sum of pairwise distinct units, if the unit equation [Formula: see text] has a non-trivial solution [Formula: see text]. We generalize this result and give applications to signed double-base digit expansions.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Linear Combinations of Units with Bounded Coefficients

Starting with a paper of Jacobson form the 1960s, many authors became interested in characterizing all algebraic number fields in which each integer is the sum of pairwise distinct units. Although there exist many partial results for number fields of low degree, a full characterization of these number fields is still not available. Narkiewicz and Jarden posed an analogous question for sums of u...

متن کامل

The coefficients of differentiated expansions of double and triple Jacobi polynomials

Formulae expressing explicitly the coefficients of an expansion of double Jacobi polynomials which has been partially differentiated an arbitrary number of times with respect to its variables in terms of the coefficients of the original expansion are stated and proved. Extension to expansion of triple Jacobi polynomials is given. The results for the special cases of double and triple ultraspher...

متن کامل

Minimal Weight Expansions in Some Pisot Bases

For numeration systems representing real numbers and integers, which are based on Pisot numbers, we study expansions with signed digits which are minimal with respect to the absolute sum of digits. It is proved that these expansions are recognizable by a finite automaton if the base β is the root of a polynomial whose (integer) coefficients satisfy a certain condition (D). When β is the Golden ...

متن کامل

Transactions on Alogorithms 1 (2005), 123–142 ANALYSIS OF LINEAR COMBINATION ALGORITHMS IN CRYPTOGRAPHY

Several cryptosystems rely on fast calculations of linear combinations in groups. One way to achieve this is to use joint signed binary digit expansions of small “weight.” We study two algorithms, one based on non adjacent forms of the coefficients of the linear combination, the other based on a certain joint sparse form specifically adapted to this problem. Both methods are sped up using the s...

متن کامل

Spectrum and essential spectrum of linear combinations of composition operators on the Hardy space H2

Let -----. For an analytic self-map ---  of --- , Let --- be the composition operator with composite map ---  so that ----. Let ---  be a bounded analytic function on --- . The weighted composition operator ---  is defined by --- . Suppose that ---  is the Hardy space, consisting of all analytic functions defined on --- , whose Maclaurin cofficients are square summable. .....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 171  شماره 

صفحات  -

تاریخ انتشار 2013